Weighted Neighborhood Sequences in Non-standard Three-Dimensional Grids - Parameter Optimization
نویسندگان
چکیده
Recently, a distance function was defined on the face-centered cubic and body-centered cubic grids by combining weights and neighborhood sequences. These distances share many properties with traditional path-based distance functions, such as the city-block distance, but are less rotational dependent. We introduce four different error functions which are used to find the optimal weights and neighborhood sequences that can be used to define the distance functions with low rotational dependency.
منابع مشابه
Weighted Neighbourhood Sequences in Non-Standard Three-Dimensional Grids - Metricity and Algorithms
Recently, a distance function was defined on the face-centered cubic and body-centered cubic grids by combining weights and neighbourhood sequences. These distances share many properties with traditional path-based distance functions, such as the city-block distance, but are less rotational dependent. We present conditions for metricity and algorithms to compute the distances.
متن کاملWeighted Distances Based on Neighbourhood Sequences in Non-standard Three-Dimensional Grids
By combining weighted distances and distances based on neighbourhood sequences, a new family of distance functions with potentially low rotational dependency is obtained. The basic theory for these distance functions, including functional form of the distance between two points, is presented for the face-centered cubic grid and the body-centered cubic grid. By minimizing an error function, the ...
متن کاملNeighborhood Sequences on nD Hexagonal/Face-Centered-Cubic Grids
The two-dimensional hexagonal grid and the three-dimensional face-centered cubic grid can be described by intersecting Z and Z with a (hyper)plane. Corresponding grids in higher dimensions (nD) are examined. In this paper, we define distance functions based on neighborhood sequences on these, higher dimensional generalizations of the hexagonal grid. An algorithm to produce a shortest path based...
متن کاملEffectiveness of Weighted Aggregation of Objectives for Evolutionary Multiobjective Optimization: Methods, Analysis and Applications
Multiobjective optimization using the conventional weighted aggregation of the objectives method is known to have several drawbacks. In this paper, multiobjective optimization using the weighted aggregation method is approached with the help of evolutionary algorithms. It is shown through a number of test functions that a Pareto front can be achieved from one single run of evolutionary optimiza...
متن کاملFuzzy particle swarm optimization with nearest-better neighborhood for multimodal optimization
In the last decades, many efforts have been made to solve multimodal optimization problems using Particle Swarm Optimization (PSO). To produce good results, these PSO algorithms need to specify some niching parameters to define the local neighborhood. In this paper, our motivation is to propose the novel neighborhood structures that remove undesirable niching parameters without sacrificing perf...
متن کامل